Precoloring Extensions of Brooks' Theorem
نویسندگان
چکیده
منابع مشابه
Precoloring Extensions of Brooks' Theorem
Let G be a connected graph with maximum degree k (other than a complete graph or odd cycle), let W be a precolored set of vertices in G inducing a subgraph F , and let D be the minimum distance in G between components of F . If the components of F are complete graphs and D ≥ 8 (for k ≥ 4) or D ≥ 10 (for k = 3), then every proper k-coloring of F extends to a proper k-coloring of G. If the compon...
متن کاملBrooks' Theorem and Beyond
We collect some of our favorite proofs of Brooks’ Theorem, highlighting advantages and extensions of each. The proofs illustrate some of the major techniques in graph coloring, such as greedy coloring, Kempe chains, hitting sets, and the Kernel Lemma. We also discuss standard strengthenings of vertex coloring, such as list coloring, online list coloring, and Alon–Tarsi orientations, since analo...
متن کاملNo Quantum Brooks' Theorem
First, I introduce quantum graph theory. I also discuss a known lower bound on the independence numbers and derive from it an upper bound on the chromatic numbers of quantum graphs. Then, I construct a family of quantum graphs that can be described as tropical, cyclical, and commutative. I also define a step logarithm function and express with it the bounds on quantum graph invariants in closed...
متن کاملAlgebraic proof of Brooks’ theorem
We give a proof of Brooks’ theorem as well as its list coloring extension using the algebraic method of Alon and Tarsi.
متن کاملBrooks’ theorem for Bernoulli shifts
If Γ is an infinite group with finite symmetric generating set S, we consider the graph G(Γ, S) on [0, 1]Γ by relating two distinct points if an element of s sends one to the other via the shift action. We show that, aside from the cases Γ = Z and Γ = (Z/2Z) ∗ (Z/2Z), G(Γ, S) satisfies a measure-theoretic version of Brooks’ theorem: there is a G(Γ, S)-invariant conull Borel set B ⊆ [0, 1]Γ and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2004
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480103425942